A Semantic Approach for Iterated Revision in Possibilistic Logic
نویسنده
چکیده
In this paper, we propose a new approach for iterated revision in possibilistic logic by applying a one-step revision operator. We first argue that the set of KM postulates for revision is too strong to define a practical one-step revision operator and some of them should be weakened. We then present a semantic approach for iterated revision in possibilistic logic using a one-step revision operator. The computation of the semantic approach is given. We show that our revision approach satisfies almost all the DP postulates for iterated revision and some other important logical properties.
منابع مشابه
Conflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کاملEncoding Information Fusion in Possibilistic Logic: A General Framework for Rational Syntactic Merging
The problem of merging multiple sources information is central in many information processing areas such as databases integration problems, multiple criteria decision making, expert opinion pooling, etc. Recently, several approaches have been proposed to merge classical propositional bases, or sets of (non-prioritized) goals. These approaches are in general semantically defined. Like in belief ...
متن کاملSemantics for Possibilistic Disjunctive Programs
In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete information and incomplete states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic th...
متن کاملMultiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a new formula with a set of formulae as the new information, which results in a merging operator called a partial meet merging operator. The problem for the partial meet merging operator is that it needs additional informa...
متن کامل